Features for Exploiting Black-Box Optimization Problem Structure
نویسندگان
چکیده
Black-box optimization (BBO) problems arise in numerous scientific and engineering applications and are characterized by computationally intensive objective functions, which severely limit the number of evaluations that can be performed. We present a robust set of features that analyze the fitness landscape of BBO problems and show how an algorithm portfolio approach can exploit these general, problem independent, features and outperform the utilization of any single minimization search strategy. We test our methodology on data from the GECCO Workshop on BBO Benchmarking 2012, which contains 21 state-of-theart solvers run on 24 well-established functions.
منابع مشابه
Fitness Landscape Based Features for Exploiting Black-Box Optimization Problem Structure
We present a robust set of features that analyze the fitness landscape of black-box optimization (BBO) problems. We show that these features are effective for training a portfolio algorithm using Instance Specific Algorithm Configuration (ISAC). BBO problems arise in numerous applications, especially in scientific and engineering contexts. BBO problems are characterized by computationally inten...
متن کاملGray-box optimization and factorized distribution algorithms: where two worlds collide
The concept of gray-box optimization, in juxtaposition to black-box optimization, revolves about the idea of exploiting the problem structure to implement more efficient evolutionary algorithms (EAs). Work on factorized distribution algorithms (FDAs), whose factorizations are directly derived from the problem structure, has also contributed to show how exploiting the problem structure produces ...
متن کاملDiscovering and Exploiting Additive Structure for Bayesian Optimization
Bayesian optimization has proven invaluable for black-box optimization of expensive functions. Its main limitation is its exponential complexity with respect to the dimensionality of the search space using typical kernels. Luckily, many objective functions can be decomposed into additive sub-problems, which can be optimized independently. We investigate how to automatically discover such (typic...
متن کاملTowards an FCA-based Recommender System for Black-Box Optimization
Black-box optimization problems are of practical importance throughout science and engineering. Hundreds of algorithms and heuristics have been developed to solve them. However, none of them outperforms any other on all problems. The success of a particular heuristic is always relative to a class of problems. So far, these problem classes are elusive and it is not known what algorithm to use on...
متن کاملA New Framework for the Valuation of Algorithms for Black-Box Optimization
Black-box optimization algorithms optimize a fitness function f without knowledge of the specific parameters of the problem instance. Their run time is measured as the number of f -evaluations. This implies that the usual algorithmic complexity of a problem cannot be applied in the black-box scenario. Therefore, a new framework for the valuation of algorithms for black-box optimization is prese...
متن کامل